Informatics Publishing Limited

Niroj K. Panda ¹, A. Yugandhara Rao ¹, K. Ramesh Kumar ², R. Mohanty ², P. S. Parihar ²

Affiliations
1 BSOI Group, 39-3-23/5 to 9, BVR mansions, Near Masjid Bus Stop, Murali Nagar, Visakhapatnam 530 007, IN
2 AMD Complex, Begumpet, Hyderabad 500 016, IN

Abstract

No Abstract.

Full Text

   

K. Ramesh Kumar ¹, Dheeraj Pande ¹, Arpan Misra ¹, L. K. Nanda ¹

Affiliations
1 Atomic Minerals Directorate for Exploration and Research, Western Region, Sector-V, Pratap Nagar Extn, Jaipur - 302 030, IN

Abstract

The Didwana playa, the second largest playa in the eastern part of the Thar desert, is 5.6 km long and 2.4 km wide and supports commercial salt production. The thickness of lake sediment package is reported to be 20 m and comprises fine grained clays and silts, with abundant calcite, gypsum, and halite,associated with hypersaline water. Isolated hills of graphitic phyllite and quartzite are seen on the western side of the lake. During the course of investigations for uranium in surficial environment of semi-arid terrain of Rajasthan, ground water sampling defined a NE-SW trending uranium halo encompassing the Didwana playa. Subsequent sampling of unlined dug wells, up to water table in central part of the playa, indicated uranium values up to 190 ppm and 2072 ppb in lake sediments and brine respectively. These values are of the order of 21 ppm and 192 ppb towards the southwestern periphery of the lake. The average uranium content, as inferred from 12 samples in the central part of the lake, is around 60 ppm over a thickness of 5 m. It appears that the uranium is loosely bonded to the sediments in amorphous form and is, hence, easily leachable. Samples of brine (n = 10), from both the central and southwestern portions of the lake, analysed high (1,67,500-3,00,000 mg/l) TDS, HCO₃^- (1128-8395 mg/l), and SO₄(30,536-88,000 mg/l). These are of alkaline (pH: 7.2-9.3) and reducing (Eh: -200 to -340 mV) nature. Under these Eh-pH conditions below the groundwater table, and for such uranium bearing groundwater, precipitation of primary uranium is expected. It is, therefore, modelled that uranium in lake sediment package above water table is concentrated by evaporation process and by chemical reduction below the water table.

As the sampling is so far confined to zones above water table, the above possibility is still to be examined. Features like high intrinsic uranium in lake (playa) sediments as well as groundwater, the alkaline and reducing nature of groundwater, which may facilitate precipitation of primary uranium below water table, and the large extent of the lake sediments (10 sq km × 20 m thickness) make the Didwana Lake, a potential candidate for hosting a surficial-type uranium occurrence of significance, for which samples below water table need to be generated. These studies are expected to establish the lake sediment environment in semi-arid tracts of Rajasthan as a new target horizon for locating surficial-type uranium mineralisation in India.

Keywords

Didwana, Playa, Lake Sediments, Uraniferous Brines, Rajasthan.

Full Text

     

E. R. Naganathan ¹, S. Narayanan ², K. Ramesh Kumar ²

Affiliations
1 Department of Computer Applications, Velammal College of Management and Computer Studies, Ambattur-Redhills Road, Chennai – 600066 Tamil Nadu, IN
2 Dept. of Computer Sci. & Engg., Alagappa University, Karaikudi-630003, Tamil Nadu, IN

Abstract

Frequent itemset discovery algorithms have been used to solve various interesting problems over the year.  As data mining techniques are being introduced and widely applied to non-traditional itemsets, existing approaches for finding frequent itemsets cannot be used as they cannot model the requirement of these domains.  An alternate way of modeling the objects in these data sets, is to use a graph to model the database objects.  Within that model, the problem of finding frequent patterns becomes that of finding subgraphs that occur frequently over the entire set of graphs.   Modeling objects using graphs allows us to represne tarbitrary relations among entities.  In this paper we present a computationally efficient algorithm for finding the ranking of such frequent subgraphs.  The subgraph finding method may follow any one of the existing algorithm.  In order to find out the ranking of subgraphs we present a new method called “graphgain”.  A graphgain is the normalization technique applied at each position for a chosen value of Discounted Cumulative Gain (DCG) of a subgraph.  The DCG alone cannot be used to achieve the performance from one query to the next in the search engine’s algorithm.  To obtain the graphgain an ideal ordering of DCG (IDCG) at each position is to be found out.  For this, a Modified Dicounted Cumulative Gain using “lift” is introduced here and IDCG is also evaluated.  Then the graphgain is evaluated.  Finally, the graphgain for all rules can be averaged to obtain a measure of the average performance of a search engine’s ranking algorithm.  And also the ordering of graphgain will provide the order of evaluation of rules which gives in turn the efficient ranking of subgraph process.

 

Keywords

Graphgain, Lift, Discounted Cumulative Gain.

Full Text

     

E. Ramaraj ¹, K. Ramesh Kumar ²

Affiliations
1 Computer Centre, Alagappa University, Karaikudi-630002, Tamilnadu, IN
2 Department of Computer Science and Engineering, Alagappa University, Karaikudi-630002, Tamilnadu, IN

Abstract

Association rule mining is to extract the interesting correlation and relation between the large volumes of databases. Association rule mining process is divided into two sub problem: The first problem is to find the frequent itemsets from the transaction and second problem is to construct the rule from the mined frequent itemset. Frequent itemsets generation is the prerequisite and most time overwhelming process for association rule mining. Apriori algorithm is the familiar and fundamental algorithm to generate the frequent itemsets from the transaction sets. Till now, Lot of researcher modified the Apriori in various manner like partition approach, Hash function and etc. But most efficient Apriori-like algorithms rely heavily on the minimum support constraints to prune the vast amount of non-candidate itemsets. These algorithms store many unwanted itemsets and transactions. In this paper propose a novel frequent itemsets generation algorithm. The drawback of the HEA, AprioriTId and Apriori overcome by the proposed algorithm. The proposed algorithm is an improved version of High Efficient AprioriTid (HEA) algorithm. The proposed algorithm is using the two theorems which are proposed in this paper. The proposed algorithm is tested with the synthetic retail dataset. It performed well at low supports. The experimental reports also show that proposed algorithm on an outset is faster than HEA, AprioriTID and Apriori.

Keywords

Data Mining, Association Rule Mining, Frequent Itemsets, Transaction Reduction.

Full Text

     

U. Latha ¹, K. Ramesh Kumar ²

Affiliations
1 Department of Information Technology, Dhaanish Ahmed College of Engineering, IN
2 Department of Information Technology, Hindustan University, IN

Abstract

The Biometric data is subject to on-going changes and create a crucial problem in fingerprint database. To deal with this, a security protocol is proposed to protect the finger prints information from the prohibited users. Here, a security protocol is proposed to protect the finger prints information. The proposed system comprised of three phases namely, fingerprint reconstruction, feature extraction and development of trigon based security protocol. In fingerprint reconstruction, the different crack variance level finger prints images are reconstructed by the M-band Dual Tree Complex Wavelet Transform (DTCWT). After that features are extracted by binarization. A set of finger print images are utilized to evaluate the performance of security protocol and the result from this process guarantees the healthiness of the proposed trigon based security protocol. The implementation results show the effectiveness of proposed trigon based security protocol in protecting the finger print information and the achieved improvement in image reconstruction and the security process.

Keywords

Fingerprint Reconstruction, Complex Wavelet Transform (CWT), 2D Dual Tree Complex Wavelet Transform (DTCWT), Trigon Based Security Protocol, Binarization.

Full Text

     

J. Mary Jasmine Victor ¹, B. Venkateswara Rao ¹, K. Ramesh Kumar ¹

Affiliations
1 Defence Research & Development Laboratory, Hyderabad - 500058, IN

Abstract

Tolerancing plays a vital role in design process. For aerospace components, any deviation beyond allowable limit can result in catastrophic failure.In this work, toleranceanalysis is performed to address axis misalignment due to tolerance stacking in flight vehicle components and allocation of optimal tolerances for minimum cost obtained using DFM analysis.

Keywords

Geometric Dimensioning & Tolerancing (GD&T), Tolerance Allocation, Tolerance Analysis (TA), Worst-Case TA, Statistical TA, Design for Manufacture (DFM).

Full Text